Cuckoo and Levy Flights Algorithm Applied to Unit-Commitment Problem

Cuckoo search via Levy flights applied to uncapacitated facility location problem

Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...

A Primal-Proximal Heuristic Applied to the Unit-Commitment Problem

This paper is devoted to the numerical resolution of unit-commitment problems. More precisely we present the French model optimizing the daily production of electricity. Its resolution is done is two phases: first a Lagrangian relaxation solves the dual to find a lower bound; it also gives a primal relaxed solution. The latter is used in the second phase for a heuristic resolution based on a pr...

Solving the Unit Commitment Problem Using Modified Imperialistic Competition Algorithm

One of the most important problems for power system operation is unit commitment (UC), for which different constraints should be satisfied. UC is a nonlinear and large-scale problem; thus, using the evolutionary algorithms has been considered for solving the problem. In this paper, the solution of the UC problem was investigated using Modified Imperialistic Competition Algorithm (MICA).  Simula...

Mutations as Levy flights

Data on single-nucleotide polymorphisms and large chromosomal rearrangements, coming from a long time evolution experiment with Escherichia Coli, are analyzed in order to argue that mutations along a cell lineage can be modeled as Levy flights in an abstract mutation space. These Levy flights have two components: random single-base substitutions and large DNA rearrangements. The data provide es...

Simulated Annealing Combined with Evolutionary Algorithm to Unit Commitment Problem